Line connectivity algorithms for an asynchronous pyramid computer
نویسندگان
چکیده
منابع مشابه
Line connectivity algorithms for an asynchronous pyramid computer
Line tracing, which has been conjectured to play an important role in the visual perception of connectivity relations, is examined in this paper from the computational point of view. The problem is formulated in terms of pixel connectivity, with thin black lines on a white background serving as input. The complexity of line tracing is discussed relative to several computation models. Two algori...
متن کاملPyramid-based Computer Graphics the Pyramid Representation and Computer Graphics
Pyramid-based graphics techniques can provide realistic computer graphics on small systems without the complexities of physics simulations. Human beings have an intuitive feel for graphics. Graphics problems such as blending two images smoothly, interpolating to fill in missing image data, or creating realistic looking images are routinely solved by artists using traditional media. It i s much ...
متن کاملPyramid segmentation algorithms revisited
The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks. Segmentation algorithms based on regular and irregular pyramids are described, together with the data structures and decimation procedures which encode and manage the information in the pyramid. In order to compare the different segmentation algorithms, we have employed three types of quality mea...
متن کاملData Movement Techniques for the Pyramid Computer
The pyramid computer was initially proposed for performing high-speed low-level image processing. However, its regular geometry can be adapted naturally to many other problems, providing effective solutions to problems more complex than those previously considered. We illustrate this by presenting pyramid computer solutions to problems involving component labeling, minimal spanning forests, nea...
متن کاملPyramid algorithms for barycentric rational interpolation
We present a new perspective on the Floater–Hormann interpolant. This interpolant is rational of degree (n, d), reproduces polynomials of degree d, and has no real poles. By casting the evaluation of this interpolant as a pyramid algorithm, we first demonstrate a close relation to Neville’s algorithm. We then derive an O(nd) algorithm for computing the barycentric weights of the Floater–Hormann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision, Graphics, and Image Processing
سال: 1987
ISSN: 0734-189X
DOI: 10.1016/s0734-189x(87)80141-x